Computational complexity of diagram satisfaction in Euclidean geometry
نویسندگان
چکیده
منابع مشابه
Computational complexity of diagram satisfaction in Euclidean geometry
In this paper, it is shown that the problem of deciding whether or not a geometric diagram in Euclidean Geometry is satisfiable is NP-hard and in PSPACE, and in fact has the same complexity as the satisfaction problem for a fragment of the existential theory of the real numbers. The related problem of finding all of the possible (satisfiable) diagrams that can result when a segment of a diagram...
متن کاملComputational Complexity of Constraint Satisfaction
The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations over the appropriate domains; the question is if there is an assignment of values to the variables that satisfies all constraints. Different algorithmic tasks for CSPs (checking satisfiability, counting the number of solutions, ...
متن کاملSpatial Analysis in curved spaces with Non-Euclidean Geometry
The ultimate goal of spatial information, both as part of technology and as science, is to answer questions and issues related to space, place, and location. Therefore, geometry is widely used for description, storage, and analysis. Undoubtedly, one of the most essential features of spatial information is geometric features, and one of the most obvious types of analysis is the geometric type an...
متن کاملEuclidean Geometry before non-Euclidean Geometry
In [3], in my argument for the primacy of Euclidean geometry on the basis of rigid motions and the existence of similar but non-congruent triangles, I wrote the following: A: “The mobility of rigid objects is now recognized as one of the things every normal human child learns in infancy, and this learning appears to be part of our biological progaramming.” B. “. . . we are all used to thinking ...
متن کاملGeneralized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence
It sounds good when knowing the generalized voronoi diagram a geometry based approach to computational intelligence in this website. This is one of the books that many people looking for. In the past, many people ask about this book as their favourite book to read and collect. And now, we present hat you need quickly. It seems to be so happy to offer you this famous book. It will not become a u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2006
ISSN: 0885-064X
DOI: 10.1016/j.jco.2005.09.003